Some further results on the measurement of inequality
نویسندگان
چکیده
منابع مشابه
Further results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملSome Further Results on the Recovery Algorithms
When seeking a representation of a signal on a redundant basis one generally replaces the quest for the sparsest model by an `1 minimization and solves thus a linear program. In the presence of noise one has in addition to replace the exact reconstruction constraint by an approximate one. We consider simultaneously several ways to allow for reconstruction errors and detail the optimality condit...
متن کاملfurther results on odd mean labeling of some subdivision graphs
let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defi ned by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...
متن کاملOn Some Tighter Inapproximability Results, Further Improvements
Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence sat-issability problems, like MAX-2SAT and E2-LIN-2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the rst time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 1973
ISSN: 0022-0531
DOI: 10.1016/0022-0531(73)90034-3